Coincidences and Estimation of Entropies of Random Variables with Large Cardinalities

نویسنده

  • Ilya Nemenman
چکیده

We perform an asymptotic analysis of the NSB estimator of entropy of a discrete random variable. The analysis illuminates the dependence of the estimates on the number of coincidences in the sample and shows that the estimator has a well defined limit for a large cardinality of the studied variable. This allows estimation of entropy with no a priori assumptions about the cardinality. Software implementation of the algorithm is available.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coincidences And Entropies of Random Variables with Very Large Alphabets

We examine the recently introduced NSB estimator of entropies of severely undersampled discrete variables and devise a procedure for calculating the involved integrals. We discover that the output of the estimator has a well defined limit for large cardinalities of the variables being studied. Thus one can estimate entropies with no a priori assumptions about these cardinalities, and a closed f...

متن کامل

Inference of Entropies of Discrete Random Variables with Unknown Cardinalities

We examine the recently introduced NSB estimator of entropies of severely undersampled discrete variables and devise a procedure for calculating the involved integrals. We discover that the output of the estimator has a well defined limit for large cardinalities of the variables being studied. Thus one can estimate entropies with no a priori assumptions about these cardinalities, and a closed f...

متن کامل

A Signal Processing Approach to Estimate Underwater Network Cardinalities with Lower Complexity

An inspection of signal processing approach in order to estimate underwater network cardinalities is conducted in this research. A matter of key prominence for underwater network is its cardinality estimation as the number of active cardinalities varies several times due to numerous natural and artificial reasons due to harsh underwater circumstances. So, a proper estimation technique is mandat...

متن کامل

Of fishes and birthdays: Efficient estimation of polymer configurational entropies

We present an algorithm to estimate the configurational entropy S of a polymer. The algorithm uses the statistics of coincidences among random samples of configurations and is related to the catch-tag-release method for estimation of population sizes, and to the classic “birthday paradox”. Bias in the entropy estimation is decreased by grouping configurations in nearly equiprobable partitions b...

متن کامل

Characterizations Using Entropies of Records in a Geometric Random Record Model

Suppose that a geometrically distributed number of observations are available from an absolutely continuous distribution function $F$, within this set of observations denote the random number of records by $M$. This is called geometric random record model. In this paper, characterizations of $F$ are provided in terms of the subsequences entropies of records conditional on events ${M geq n}$ or ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Entropy

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2011